翻訳と辞書
Words near each other
・ János Máté
・ János Nagy
・ János Nagy (footballer born 1992)
・ János Nagy Balogh
・ János Nehadoma
・ János Négyesy
・ János Németh
・ János Pach
・ János Pap
・ János Parti
・ János Patály
・ János Petki
・ János Petroczy
・ János Petrán
・ János Pilinszky
János Pintz
・ János Pintér
・ János Plesch
・ János Pálffy
・ János Pásztor
・ János Pénzes
・ János Péter
・ János Pócs
・ János Radványi
・ János Rajz
・ János Rátkai
・ János Rózsa
・ János Rózsás
・ János Sajnovics
・ János Sarusi Kis


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

János Pintz : ウィキペディア英語版
János Pintz

János Pintz (December 20, 1950, Budapest)〔Peter Hermann, Antal Pasztor: ''Magyar és nemzetközi ki kicsoda'', 1994〕 is a Hungarian mathematician working in analytic number theory. He is a fellow of the Rényi Mathematical Institute and is also a member of the Hungarian Academy of Sciences. In 2014 he received the Cole Prize.
==Mathematical results==
Pintz is best known for proving in 2005 (with Daniel Goldston and Cem Yıldırım)〔http://arxiv.org/abs/math/0508185〕 that
:: \liminf_\frac=0
where p_n\ denotes the ''n''th prime number. In other words, for every ε > 0, there exist infinitely many pairs of consecutive primes ''p''''n'' and ''p''''n''+1 that are closer to each other than the average distance between consecutive primes by a factor of ε, i.e., ''p''''n''+1 − ''p''''n'' < ε log ''p''''n''. This result was originally reported in 2003 by Daniel Goldston and Cem Yıldırım but was later retracted.〔http://aimath.org/primegaps/〕〔http://www.aimath.org/primegaps/residueerror/〕 Pintz joined the team and completed the proof in 2005. Later they improved this to showing that ''p''''n''+1 − ''p''''n'' < ε√log ''n''(log log ''n'')2 occurs infinitely often. Further, if one assumes the Elliott–Halberstam conjecture, then one can also show that primes within 16 of each other occur infinitely often, which is nearly the twin prime conjecture.
Additionally,
* With János Komlós and Endre Szemerédi he disproved the Heilbronn conjecture.〔.〕
* With Iwaniec he proved that for sufficiently large ''n'' there is a prime between ''n'' and ''n'' + ''n''23/42.
* Pintz gave an effective upper bound for the first number for which the Mertens conjecture fails.
* He gave an O(''x''2/3) upper bound for the number of those numbers that are less than ''x'' and not the sum of two primes.
* With Imre Z. Ruzsa he improved a result of Linnik by showing that every sufficiently large even number is the sum of two primes and at most 8 powers of 2.
* Goldston, S. W. Graham, Pintz, and Yıldırım proved that the difference between numbers which are products of exactly 2 primes is infinitely often at most 6.〔D. Goldston, S. W. Graham, J. Pintz, C. Yıldırım: Small gaps between products of two primes, Proc. Lond. Math. Soc., 98(2007) 741–774.〕

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「János Pintz」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.